On the random graph induced by a random key predistribution scheme under full visibility (Extended version)
نویسندگان
چکیده
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier results and analogies with Erdős-Renyi graphs, we explore similar results for the property of graph connectivity. Implications for secure connectivity are discussed.
منابع مشابه
Connectivity in random key graphs – Simple proofs for special cases
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for some special cases.
متن کاملRandom Graph Modeling of Key Distribution Schemes in Wireless Sensor Networks
Title of dissertation: RANDOM GRAPH MODELING OF KEY DISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKS Osman Yağan, Doctor of Philosophy, 2011 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for computations and wireless communications. It is en...
متن کاملA zero-one law for the existence of triangles in random key graphs
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles i...
متن کاملRandom key graphs can have many more triangles than Erdős-Rényi graphs
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor (EG) under the assumption of full visibility. For this class of random graphs we establish a zero-one law for the existence of triangles, and identify the corresponding critical scaling. This zero-one law exhibits significant differences with the corresponding result in Erdős-Rényi grap...
متن کاملOn random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version)
The pairwise key distribution scheme of Chan et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor (EG) to enable network security in wireless sensor networks. In this paper we consider the random graph induced by this pairwise scheme under the assumption of full visibility. We first establish a zero-one law for graph connectivity. Then, we discuss the nu...
متن کامل